Solving a constrained economic lot size problem by ranking efficient production policies

<p style='text-indent:20px;'>We address the problem of finding <inline-formula><tex-math id="M1">\begin{document}$ K $\end{document}</tex-math></inline-formula> best Zero-Inventory-Ordering (ZIO) policies an Economic Lot-Sizing Problem (ELSP) with id="M2">\begin{document}$ n time periods. To this end, we initially focus on devising efficient algorithm to determine Second Best ZIO policy. Based both latter and recent results from state-of-the-art literature, propose a solution method compute remaining id="M3">\begin{document}$ in id="M4">\begin{document}$ O(n(K+n)) id="M5">\begin{document}$ O(K+n^2 ) space. One claimed advantage approach is that it would efficiently solve family ELS problems, which includes basic knapsack type constraint. A computational experiment carried out test performance new id="M6">\begin{document}$ $\end{document}</tex-math></inline-formula>-ZIO Constrained-ZIO for different values id="M7">\begin{document}$ id="M8">\begin{document}$ $\end{document}</tex-math></inline-formula>. For particular case when left-hand side coefficients constraint are equal, provide id="M9">\begin{document}$ O(n^3 method.</p>